Faster Constant-Time Decoder for MDPC Codes and Applications to BIKE KEM

نویسندگان

چکیده

BIKE is a code-based key encapsulation mechanism (KEM) that was recently selected as an alternate candidate by the NIST’s standardization process on post-quantum cryptography. This KEM based Niederreiter scheme instantiated with QC-MDPC codes, and it uses BGF decoder for decapsulation. We discovered important limitations of we describe in detail, then propose new decoding algorithm codes called PickyFix. Our two auxiliary iterations are significantly different from previous approaches show how they can be implemented efficiently. analyze our respect to both its error correction capacity performance practice. When compared BGF, constant-time implementation PickyFix achieves speedups 1.18, 1.29, 1.47 security levels 128, 192 256, respectively.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The decoding failure probability of MDPC codes

Moderate Density Parity Check (MDPC) codes are defined here as codes which have a parity-check matrix whose row weight is O( √ n) where n is the length n of the code. They can be decoded like LDPC codes but they decode much less errors than LDPC codes: the number of errors they can decode in this case is of order Ω( √ n). Despite this fact they have been proved very useful in cryptography for d...

متن کامل

On the Decoder Error Probability of Rank Metric Codes and Constant-Dimension Codes

Rank metric codes can either be used as such for error correction in data storage equipments, or be lifted into constant-dimension codes (CDCs) and thus be used for error correction in random network coding. This paper investigates the decoder error probability (DEP) of rank metric codes and CDCs. We first study the DEP of rank metric codes using a bounded rank distance decoder. We derive asymp...

متن کامل

Optimizing Information Set Decoding Algorithms to Attack Cyclosymmetric MDPC Codes

The most important drawback to code-based cryptography has historically been its large key sizes. Recently, several promising approaches have been proposed to reduce keysizes. In particular, significant keysize reduction has been achieved by using structured, but nonalgebraic codes, such as quasi-cyclic (QC) Moderate Density Parity Check (MDPC) codes. Biasi et al. propose further reducing the k...

متن کامل

Isotropic Constant Dimension Subspace Codes

 In network code setting, a constant dimension code is a set of k-dimensional subspaces of F nq . If F_q n is a nondegenerated symlectic vector space with bilinear form f, an isotropic subspace U of F n q is a subspace that for all x, y ∈ U, f(x, y) = 0. We introduce isotropic subspace codes simply as a set of isotropic subspaces and show how the isotropic property use in decoding process, then...

متن کامل

Protograph-based Quasi-Cyclic MDPC Codes for McEliece Cryptosystems

In this paper, ensembles of quasi-cyclic moderatedensity parity-check (MDPC) codes based on protographs are introduced and analyzed in the context of a McEliece-like cryptosystem. The proposed ensembles significantly improve the error correction capability of the regular MDPC code ensembles that are currently considered for post-quantum cryptosystems without increasing the public key size. The ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IACR transactions on cryptographic hardware and embedded systems

سال: 2022

ISSN: ['2569-2925']

DOI: https://doi.org/10.46586/tches.v2022.i4.110-134